Finding Similar Deductive Consequences - A New Search-Based Framework for Unified Reasoning from Cases and General Knowledge
نویسندگان
چکیده
While reasoning with cases is usually done in a similaritybased manner, additional general knowledge is often represented in rules, constraints, or ontology definitions and is applied in a deductive reasoning process. This paper presents a new view on the combination of deductive and similarity-based reasoning, which is embedded in the CBR context. The basic idea is to view general knowledge and cases as a logical theory of a domain. Similarity-based reasoning is introduced as search for the most similar element in the deductive closure of the domain theory. We elaborate this approach and introduce several related search algorithms, which are analyzed in an experimental study. Further, we show how several previous approaches for using general knowledge in CBR can be mapped to our new view.
منابع مشابه
INTEGRATING CASE-BASED REASONING, KNOWLEDGE-BASED APPROACH AND TSP ALGORITHM FOR MINIMUM TOUR FINDING
Imagine you have traveled to an unfamiliar city. Before you start your daily tour around the city, you need to know a good route. In Network Theory (NT), this is the traveling salesman problem (TSP). A dynamic programming algorithm is often used for solving this problem. However, when the road network of the city is very complicated and dense, which is usually the case, it will take too long fo...
متن کاملModels of clinical reasoning with a focus on general practice: a critical review
Introduction: Diagnosis lies at the heart of general practice.Every day general practitioners (GPs) visit patients with awide variety of complaints and concerns, with often minor butsometimes serious symptoms. General practice has many featureswhich differentiate it from specialty care setting, but during thelast four decades little attention was paid to clinical reasoningin general practice. T...
متن کاملA Knowledge-Intensive, Integrated Approach to Problem Solving and Sustained Learning
Improved methods for development and maintenance of real world knowledge-based systems are strongly needed. A computer system targeted to be an active assistant in solving practical problems in, e.g., industries and governmental institutions, should be able to capture a variety of knowledge types (concept definitions, principles, heuristics, previous experiences), and effectively utilize this e...
متن کاملDatabase Reasoning - A Deductive Framework for Solving Large and Complex Problems by Means of Subsumption
After two decades of experience with relational databases and almost one decade with deductive databases a substantial amount of knowledge for eecient query processing methods and query optimizer technology is broadly available. So far, however, these research and development eeorts have not paid too much attention to optimizations based on semantic or heuristic information as it is often deman...
متن کاملA Framework for Adapting Population-Based and Heuristic Algorithms for Dynamic Optimization Problems
In this paper, a general framework was presented to boost heuristic optimization algorithms based on swarm intelligence from static to dynamic environments. Regarding the problems of dynamic optimization as opposed to static environments, evaluation function or constraints change in the time and hence place of optimization. The subject matter of the framework is based on the variability of the ...
متن کامل